A hybrid level set method for modelling detonation and combustion problems in complex geometries

We present an accurate and fast wave tracking method that uses parametric representations of tracked fronts, combined with modifications of level set methods that use narrow bands. Our strategy generates accurate computations of the front curvature and other geometric properties of the front. We introduce data structures that can store discrete representations of the location of the moving fronts and boundaries, as well as the corresponding level set fields, that are designed to reduce computational overhead and memory storage. We present an algorithm we call stack sweeping to efficiently sort and store data that is used to represent orientable fronts. Our implementation features two reciprocal procedures, a forward ‘front parameterization’ that constructs a parameterization of a front given a level set field and a backward ‘field construction’ that constructs an approximation of the signed normal distance to the front, given a parameterized representation of the front. These reciprocal procedures are used to achieve and maintain high spatial accuracy. Close to the front, precise computation of the normal distance is carried out by requiring that displacement vectors from grid points to the front be along a normal direction. For front curves in two dimensions, a cubic interpolation scheme is used, and G ¹ surface parameterization based on triangular patches is used for the three-dimensional implementation to compute the distances from grid points near the front. To demonstrate this new, high accuracy method we present validations and show examples of combustion-like applications that include detonation shock dynamics, material interface motions in a compressible multi-material simulation and the Stephan problem associated with dendrite solidification.     

Cantor-type cylindrical-coordinate method for differential equations with local fractional derivatives

In this Letter, we propose to use the Cantor-type cylindrical-coordinate method in order to investigate a family of local fractional differential operators on Cantor sets. Some testing examples are given to illustrate the capability of the proposed method for the heat-conduction equation on a Cantor set and the damped wave equation in fractal strings. It is seen to be a powerful tool to convert differential equations on Cantor sets from Cantorian-coordinate systems to Cantor-type cylindrical-coordinate systems.     

Generalized matching theorems for closed coverings of convex sets

In this paper we use fixed point and coincidence theorems due to Park [8] to give matching theorems concerning closed coverings of nonempty convex sets in a real topological vector space. Our new results extend previously given ones due to Ky Fan [2], [3], Shih [10], Shih and Tan [11], and Park [7].     

Hierarchical Model-Based Clustering for Large Datasets

In recent years, hierarchical model-based clustering has provided promising results in a variety of applications. However, its use with large datasets has been hindered by a time and memory complexity that are at least quadratic in the number of observations. To overcome this difficulty, this article proposes to start the hierarchical agglomeration from an efficient classification of the data in many classes rather than from the usual set of singleton clusters. This initial partition is derived from a subgraph of the minimum spanning tree associated with the data. To this end, we develop graphical tools that assess the presence of clusters in the data and uncover observations difficult to classify. We use this approach to analyze two large, real datasets: a multiband MRI image of the human brain and data on global precipitation climatology. We use the real datasets to discuss ways of integrating the spatial information in the clustering analysis. We focus on two-stage methods, in which a second stage of processing using established methods is applied to the output from the algorithm presented in this article, viewed as a first stage.     

优化端点条件的平面二次均匀B样条插值曲线

在利用反求法构造B样条插值曲线时，往往需要选取端点条件。 因此，可对端点条件进行优化选取，使得构造的B样条插值曲线满足特定要求。提出了一种利用曲线内能极小选取平面二次均匀B样条插值曲线端点条件的算法。首先给出了二次均匀B样条插值曲线分控制顶点与首个控制顶点（即端点条件）的递推关系式；然后给出了利用曲线内能极小优化选取首个控制顶点的算法，证明了利用该算法构造的C¹连续二次均匀B样条插值曲线为保形插值，并通过数值算例证明了算法的有效性；最后，为便于实际应用，基于MATLAB平台设计了算法所对应的图形用户界面，用户通过简单的操作即可获得光顺的C¹连续二次均匀B样条保形插值曲线。     

On generalized perfect difference sets constructed from Sidon sets

Let $\mathbb{N}$ be the set of positive integers. For a nonempty set A of integers and every integer u, denote by $d_A(u)$ the number of $(a,a^{\prime })$ with $a,a^{\prime }\in A$ such that $u=a-a^{\prime }$. For a sequence S of positive integers, let $S(x)$ be the counting function of S. The set $A\subseteq \mathbb{N}$ is called a perfect difference set if $d_A(u)=1$ for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let $f:\mathbb{N}\to \mathbb{N}$ be an increasing function satisfying $f(n)\ge 2$ for any positive integer n, then for every Sidon set B and every function $\omega (x)\to \infty$, there exists a set $A\subseteq \mathbb{N}$ such that $d_A(u)=f(u)$ for every positive integer u and $B(x/3)-\omega (x)\le A(x)\le B(x/3)+\omega (x)$ for all $x\ge C_{f,B,\omega }$.     

概率语言多属性群决策方法及其在新型智慧城市市民获得感评价中的应用

针对公众参与的语言信息多属性群决策问题，研究了考虑参与者满意度的概率语言多属性群决策方法。首先，根据参与者的语言评价信息确定并规范化概率语言决策矩阵。然后，对大群体进行共识分析，由最大化参与者群体的满意度构建线性规划模型，确定参与者群组的权重；构造正、负理想方案的评价向量，构建多目标规划模型，用拉格朗日乘子法求解属性权重；定义各方案的加权贴近度，并以此对方案进行排序和优选。最后，通过新型智慧城市市民获得感评价案例验证了模型的可行性和有效性。     

极大3限制边连通二部图的充分条件

设G=(V,E)是一个连通图.称一个边集合S■E是一个k限制边割,如果G-S的每个连通分支至少有k个顶点.称G的所有k限制边割中所含边数最少的边割的基数为G的k限制边连通度,记为λ_k(G).定义ξ_k(G)=min{[X,■]:|X|=k,G[X]连通,■=V(G)\X}.称图G是极大k限制边连通的,如果λ_k(G)=ξ_k(G).本文给出了围长为g>6的极大3限制边连通二部图的充分条件.     

On some types of covering rough sets from topological points of view

The concept of coverings is one of the fundamental concepts in topological spaces and plays a big part in the study of topological problems. This motivates the research of covering rough sets from topological points of view. From topological points of view, we can get a good insight into the essence of covering rough sets and make our discussions concise and profound. In this paper, we first construct a type of topology called the topology induced by the covering on a covering approximation space. This notion is indeed in the core of this paper. Then we use it to define the concepts of neighborhoods, closures, connected spaces, and components. Drawing on these concepts, we define several pairs of approximation operators. We not only investigate the relationships among them, but also give clear explanations of the concepts discussed in this paper. For a given covering approximation space, we can use the topology induced by the covering to investigate the topological properties of the space such as separation, connectedness, etc. Finally, a diagram is presented to show that the collection of all the lower and upper approximations considered in this paper constructs a lattice in terms of the inclusion relation ⊆.